<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml" lang="zh">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=11"/>
<meta name="generator" content="Doxygen 1.11.0"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>cppMISC: include/container/treeHeap.hpp 源文件</title>
<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../jquery.js"></script>
<script type="text/javascript" src="../../dynsections.js"></script>
<script type="text/javascript" src="../../clipboard.js"></script>
<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../resize.js"></script>
<script type="text/javascript" src="../../cookie.js"></script>
<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../search/searchdata.js"></script>
<script type="text/javascript" src="../../search/search.js"></script>
<script type="text/javascript" src="../../darkmode_toggle.js"></script>
<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
 <tbody>
 <tr id="projectrow">
  <td id="projectalign">
   <div id="projectname">cppMISC<span id="projectnumber">&#160;v1.1</span>
   </div>
   <div id="projectbrief">cppMisc 文档系统</div>
  </td>
 </tr>
 </tbody>
</table>
</div>
<!-- end header part -->
<!-- 制作者 Doxygen 1.11.0 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
/* @license-end */
</script>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(function() { codefold.init(1); });
/* @license-end */
</script>
<script type="text/javascript" src="../../menudata.js"></script>
<script type="text/javascript" src="../../menu.js"></script>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(function() {
  initMenu('../../',true,false,'search.php','搜索',false);
  $(function() { init_search(); });
});
/* @license-end */
</script>
<div id="main-nav"></div>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(function(){ initResizable(false); });
/* @license-end */
</script>
<!-- window showing the filter options -->
<div id="MSearchSelectWindow"
     onmouseover="return searchBox.OnSearchSelectShow()"
     onmouseout="return searchBox.OnSearchSelectHide()"
     onkeydown="return searchBox.OnSearchSelectKey(event)">
</div>

<!-- iframe showing the search results (closed by default) -->
<div id="MSearchResultsWindow">
<div id="MSearchResults">
<div class="SRPage">
<div id="SRIndex">
<div id="SRResults"></div>
<div class="SRStatus" id="Loading">载入中...</div>
<div class="SRStatus" id="Searching">搜索中...</div>
<div class="SRStatus" id="NoMatches">未找到</div>
</div>
</div>
</div>
</div>

<div id="nav-path" class="navpath">
  <ul>
<li class="navelem"><a class="el" href="../../dir_d44c64559bbebec7f509842c48db8b23.html">include</a></li><li class="navelem"><a class="el" href="../../dir_e0f5f6345e438c73b9ae78ec2940718c.html">container</a></li>  </ul>
</div>
</div><!-- top -->
<div id="doc-content">
<div class="header">
  <div class="headertitle"><div class="title">treeHeap.hpp</div></div>
</div><!--header-->
<div class="contents">
<a href="../../d5/df2/tree_heap_8hpp.html">浏览该文件的文档.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
<div class="line"><a id="l00004" name="l00004"></a><span class="lineno">    4</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
<div class="foldopen" id="foldopen00005" data-start="{" data-end="};">
<div class="line"><a id="l00005" name="l00005"></a><span class="lineno"><a class="line" href="../../d1/d3a/class_tree_heap.html">    5</a></span><span class="keyword">class </span><a class="code hl_class" href="../../d1/d3a/class_tree_heap.html">TreeHeap</a> {</div>
<div class="line"><a id="l00006" name="l00006"></a><span class="lineno">    6</span><span class="keyword">public</span>:</div>
<div class="foldopen" id="foldopen00007" data-start="{" data-end="};">
<div class="line"><a id="l00007" name="l00007"></a><span class="lineno"><a class="line" href="../../d2/d7b/struct_tree_heap_1_1_node.html">    7</a></span>    <span class="keyword">struct </span><a class="code hl_struct" href="../../d2/d7b/struct_tree_heap_1_1_node.html">Node</a> {</div>
<div class="line"><a id="l00008" name="l00008"></a><span class="lineno"><a class="line" href="../../d2/d7b/struct_tree_heap_1_1_node.html#abeb17dd9d45f77ef6d19229e4b59c7e7">    8</a></span>        T <a class="code hl_variable" href="../../d2/d7b/struct_tree_heap_1_1_node.html#abeb17dd9d45f77ef6d19229e4b59c7e7">value</a>;</div>
<div class="line"><a id="l00009" name="l00009"></a><span class="lineno"><a class="line" href="../../d2/d7b/struct_tree_heap_1_1_node.html#a0a6d9e6ae1284ca29e195474235a8a92">    9</a></span>        std::shared_ptr&lt;Node&gt; <a class="code hl_variable" href="../../d2/d7b/struct_tree_heap_1_1_node.html#a0a6d9e6ae1284ca29e195474235a8a92">left</a>;</div>
<div class="line"><a id="l00010" name="l00010"></a><span class="lineno"><a class="line" href="../../d2/d7b/struct_tree_heap_1_1_node.html#a75f14b93093a2eaf649fe97f7173cefe">   10</a></span>        std::shared_ptr&lt;Node&gt; <a class="code hl_variable" href="../../d2/d7b/struct_tree_heap_1_1_node.html#a75f14b93093a2eaf649fe97f7173cefe">right</a>;</div>
<div class="line"><a id="l00011" name="l00011"></a><span class="lineno"><a class="line" href="../../d2/d7b/struct_tree_heap_1_1_node.html#a7152a8094210883b2ae35e1cec5a0aad">   11</a></span>        std::shared_ptr&lt;Node&gt; <a class="code hl_variable" href="../../d2/d7b/struct_tree_heap_1_1_node.html#a7152a8094210883b2ae35e1cec5a0aad">parent</a>;</div>
<div class="line"><a id="l00012" name="l00012"></a><span class="lineno">   12</span> </div>
<div class="line"><a id="l00013" name="l00013"></a><span class="lineno"><a class="line" href="../../d2/d7b/struct_tree_heap_1_1_node.html#a442e2d6436b5096ba6f977039dea4f8b">   13</a></span>        <a class="code hl_function" href="../../d2/d7b/struct_tree_heap_1_1_node.html#a442e2d6436b5096ba6f977039dea4f8b">Node</a>(<span class="keyword">const</span> T&amp; val) : <a class="code hl_variable" href="../../d2/d7b/struct_tree_heap_1_1_node.html#abeb17dd9d45f77ef6d19229e4b59c7e7">value</a>(val), <a class="code hl_variable" href="../../d2/d7b/struct_tree_heap_1_1_node.html#a0a6d9e6ae1284ca29e195474235a8a92">left</a>(nullptr), <a class="code hl_variable" href="../../d2/d7b/struct_tree_heap_1_1_node.html#a75f14b93093a2eaf649fe97f7173cefe">right</a>(nullptr), <a class="code hl_variable" href="../../d2/d7b/struct_tree_heap_1_1_node.html#a7152a8094210883b2ae35e1cec5a0aad">parent</a>(nullptr) {}</div>
<div class="line"><a id="l00014" name="l00014"></a><span class="lineno">   14</span>    };</div>
</div>
<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span> </div>
<div class="line"><a id="l00016" name="l00016"></a><span class="lineno"><a class="line" href="../../d1/d3a/class_tree_heap.html#a9c06df154358196628bf2a43c0e45b45">   16</a></span>    <a class="code hl_function" href="../../d1/d3a/class_tree_heap.html#a9c06df154358196628bf2a43c0e45b45">TreeHeap</a>() : root(nullptr) {}</div>
<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span> </div>
<div class="foldopen" id="foldopen00018" data-start="{" data-end="}">
<div class="line"><a id="l00018" name="l00018"></a><span class="lineno"><a class="line" href="../../d1/d3a/class_tree_heap.html#aa3b4c8d965942a923fa22689d755f814">   18</a></span>    <span class="keywordtype">bool</span> <a class="code hl_function" href="../../d1/d3a/class_tree_heap.html#aa3b4c8d965942a923fa22689d755f814">empty</a>()<span class="keyword"> const </span>{</div>
<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span>        <span class="keywordflow">return</span> !root;</div>
<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span>    }</div>
</div>
<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span> </div>
<div class="foldopen" id="foldopen00022" data-start="{" data-end="}">
<div class="line"><a id="l00022" name="l00022"></a><span class="lineno"><a class="line" href="../../d1/d3a/class_tree_heap.html#a0f0e0675685cc3413965231f33b6b849">   22</a></span>    <span class="keywordtype">void</span> <a class="code hl_function" href="../../d1/d3a/class_tree_heap.html#a0f0e0675685cc3413965231f33b6b849">insert</a>(<span class="keyword">const</span> T&amp; val) {</div>
<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span>        <span class="keyword">auto</span> node = std::make_shared&lt;Node&gt;(val);</div>
<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span>        root = <a class="code hl_function" href="../../d1/d3a/class_tree_heap.html#ac07c0c2ac95feff5621d1ad976675599">merge</a>(root, node);</div>
<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span>    }</div>
</div>
<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span> </div>
<div class="foldopen" id="foldopen00027" data-start="{" data-end="}">
<div class="line"><a id="l00027" name="l00027"></a><span class="lineno"><a class="line" href="../../d1/d3a/class_tree_heap.html#aef1344026932a8cf74c33d7224309c30">   27</a></span>    <span class="keywordtype">void</span> <a class="code hl_function" href="../../d1/d3a/class_tree_heap.html#aef1344026932a8cf74c33d7224309c30">erase</a>(<span class="keyword">const</span> T&amp; val) {</div>
<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span>        <span class="keyword">auto</span> node = find(root, val);</div>
<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span>        <span class="keywordflow">if</span> (node) {</div>
<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span>            root = <a class="code hl_function" href="../../d1/d3a/class_tree_heap.html#ac07c0c2ac95feff5621d1ad976675599">merge</a>(node-&gt;left, node-&gt;right);</div>
<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span>            <span class="keywordflow">if</span> (root) {</div>
<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span>                root-&gt;parent = <span class="keyword">nullptr</span>;</div>
<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span>            }</div>
<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span>        }</div>
<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span>    }</div>
</div>
<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span> </div>
<div class="foldopen" id="foldopen00037" data-start="{" data-end="}">
<div class="line"><a id="l00037" name="l00037"></a><span class="lineno"><a class="line" href="../../d1/d3a/class_tree_heap.html#a44c9e56e717cd4fcb8a1f8900b708e14">   37</a></span>    T <a class="code hl_function" href="../../d1/d3a/class_tree_heap.html#a44c9e56e717cd4fcb8a1f8900b708e14">get_min</a>()<span class="keyword"> const </span>{</div>
<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span>        <span class="keywordflow">if</span> (!root) {</div>
<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span>            <span class="keywordflow">throw</span> std::logic_error(<span class="stringliteral">&quot;Heap is empty&quot;</span>);</div>
<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span>        }</div>
<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span>        <span class="keywordflow">return</span> root-&gt;value;</div>
<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span>    }</div>
</div>
<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span> </div>
<div class="foldopen" id="foldopen00044" data-start="{" data-end="}">
<div class="line"><a id="l00044" name="l00044"></a><span class="lineno"><a class="line" href="../../d1/d3a/class_tree_heap.html#ac07c0c2ac95feff5621d1ad976675599">   44</a></span>    <span class="keywordtype">void</span> <a class="code hl_function" href="../../d1/d3a/class_tree_heap.html#ac07c0c2ac95feff5621d1ad976675599">merge</a>(<a class="code hl_class" href="../../d1/d3a/class_tree_heap.html">TreeHeap</a>&amp; other) {</div>
<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span>        root = <a class="code hl_function" href="../../d1/d3a/class_tree_heap.html#ac07c0c2ac95feff5621d1ad976675599">merge</a>(root, other.root);</div>
<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span>        other.root = <span class="keyword">nullptr</span>;</div>
<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span>    }</div>
</div>
<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span> </div>
<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span><span class="keyword">private</span>:</div>
<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span>    std::shared_ptr&lt;Node&gt; root;</div>
<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span> </div>
<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span>    std::shared_ptr&lt;Node&gt; <a class="code hl_function" href="../../d1/d3a/class_tree_heap.html#ac07c0c2ac95feff5621d1ad976675599">merge</a>(std::shared_ptr&lt;Node&gt; a, std::shared_ptr&lt;Node&gt; b) {</div>
<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span>        <span class="keywordflow">if</span> (!a) {</div>
<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>            <span class="keywordflow">return</span> b;</div>
<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>        }</div>
<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>        <span class="keywordflow">if</span> (!b) {</div>
<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>            <span class="keywordflow">return</span> a;</div>
<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>        }</div>
<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>        <span class="keywordflow">if</span> (b-&gt;value &lt; a-&gt;value) {</div>
<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>            std::swap(a, b);</div>
<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>        }</div>
<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>        <span class="keywordflow">if</span> (!a-&gt;left) {</div>
<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>            a-&gt;left = b;</div>
<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>            b-&gt;parent = a;</div>
<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>        } <span class="keywordflow">else</span> {</div>
<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>            a-&gt;right = <a class="code hl_function" href="../../d1/d3a/class_tree_heap.html#ac07c0c2ac95feff5621d1ad976675599">merge</a>(a-&gt;right, b);</div>
<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>            a-&gt;right-&gt;parent = a;</div>
<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>            <span class="keywordflow">if</span> (a-&gt;right-&gt;value &lt; a-&gt;left-&gt;value) {</div>
<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>                std::swap(a-&gt;left, a-&gt;right);</div>
<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>            }</div>
<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>        }</div>
<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span>        <span class="keywordflow">return</span> a;</div>
<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span>    }</div>
<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span> </div>
<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span>    std::shared_ptr&lt;Node&gt; find(std::shared_ptr&lt;Node&gt; node, <span class="keyword">const</span> T&amp; val)<span class="keyword"> const </span>{</div>
<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span>        <span class="keywordflow">if</span> (!node) {</div>
<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span>            <span class="keywordflow">return</span> <span class="keyword">nullptr</span>;</div>
<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>        }</div>
<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>        <span class="keywordflow">if</span> (node-&gt;value == val) {</div>
<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>            <span class="keywordflow">return</span> node;</div>
<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>        }</div>
<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span>        <span class="keyword">auto</span> left = find(node-&gt;left, val);</div>
<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span>        <span class="keywordflow">if</span> (left) {</div>
<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span>            <span class="keywordflow">return</span> left;</div>
<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span>        }</div>
<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span>        <span class="keywordflow">return</span> find(node-&gt;right, val);</div>
<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span>    }</div>
<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span>};</div>
</div>
<div class="ttc" id="aclass_tree_heap_html"><div class="ttname"><a href="../../d1/d3a/class_tree_heap.html">TreeHeap</a></div><div class="ttdoc">树堆的实现</div><div class="ttdef"><b>定义</b> <a href="#l00005">treeHeap.hpp:5</a></div></div>
<div class="ttc" id="aclass_tree_heap_html_a0f0e0675685cc3413965231f33b6b849"><div class="ttname"><a href="../../d1/d3a/class_tree_heap.html#a0f0e0675685cc3413965231f33b6b849">TreeHeap::insert</a></div><div class="ttdeci">void insert(const T &amp;val)</div><div class="ttdef"><b>定义</b> <a href="#l00022">treeHeap.hpp:22</a></div></div>
<div class="ttc" id="aclass_tree_heap_html_a44c9e56e717cd4fcb8a1f8900b708e14"><div class="ttname"><a href="../../d1/d3a/class_tree_heap.html#a44c9e56e717cd4fcb8a1f8900b708e14">TreeHeap::get_min</a></div><div class="ttdeci">T get_min() const</div><div class="ttdef"><b>定义</b> <a href="#l00037">treeHeap.hpp:37</a></div></div>
<div class="ttc" id="aclass_tree_heap_html_a9c06df154358196628bf2a43c0e45b45"><div class="ttname"><a href="../../d1/d3a/class_tree_heap.html#a9c06df154358196628bf2a43c0e45b45">TreeHeap::TreeHeap</a></div><div class="ttdeci">TreeHeap()</div><div class="ttdef"><b>定义</b> <a href="#l00016">treeHeap.hpp:16</a></div></div>
<div class="ttc" id="aclass_tree_heap_html_aa3b4c8d965942a923fa22689d755f814"><div class="ttname"><a href="../../d1/d3a/class_tree_heap.html#aa3b4c8d965942a923fa22689d755f814">TreeHeap::empty</a></div><div class="ttdeci">bool empty() const</div><div class="ttdef"><b>定义</b> <a href="#l00018">treeHeap.hpp:18</a></div></div>
<div class="ttc" id="aclass_tree_heap_html_ac07c0c2ac95feff5621d1ad976675599"><div class="ttname"><a href="../../d1/d3a/class_tree_heap.html#ac07c0c2ac95feff5621d1ad976675599">TreeHeap::merge</a></div><div class="ttdeci">void merge(TreeHeap &amp;other)</div><div class="ttdef"><b>定义</b> <a href="#l00044">treeHeap.hpp:44</a></div></div>
<div class="ttc" id="aclass_tree_heap_html_aef1344026932a8cf74c33d7224309c30"><div class="ttname"><a href="../../d1/d3a/class_tree_heap.html#aef1344026932a8cf74c33d7224309c30">TreeHeap::erase</a></div><div class="ttdeci">void erase(const T &amp;val)</div><div class="ttdef"><b>定义</b> <a href="#l00027">treeHeap.hpp:27</a></div></div>
<div class="ttc" id="astruct_tree_heap_1_1_node_html"><div class="ttname"><a href="../../d2/d7b/struct_tree_heap_1_1_node.html">TreeHeap::Node</a></div><div class="ttdef"><b>定义</b> <a href="#l00007">treeHeap.hpp:7</a></div></div>
<div class="ttc" id="astruct_tree_heap_1_1_node_html_a0a6d9e6ae1284ca29e195474235a8a92"><div class="ttname"><a href="../../d2/d7b/struct_tree_heap_1_1_node.html#a0a6d9e6ae1284ca29e195474235a8a92">TreeHeap::Node::left</a></div><div class="ttdeci">std::shared_ptr&lt; Node &gt; left</div><div class="ttdef"><b>定义</b> <a href="#l00009">treeHeap.hpp:9</a></div></div>
<div class="ttc" id="astruct_tree_heap_1_1_node_html_a442e2d6436b5096ba6f977039dea4f8b"><div class="ttname"><a href="../../d2/d7b/struct_tree_heap_1_1_node.html#a442e2d6436b5096ba6f977039dea4f8b">TreeHeap::Node::Node</a></div><div class="ttdeci">Node(const T &amp;val)</div><div class="ttdef"><b>定义</b> <a href="#l00013">treeHeap.hpp:13</a></div></div>
<div class="ttc" id="astruct_tree_heap_1_1_node_html_a7152a8094210883b2ae35e1cec5a0aad"><div class="ttname"><a href="../../d2/d7b/struct_tree_heap_1_1_node.html#a7152a8094210883b2ae35e1cec5a0aad">TreeHeap::Node::parent</a></div><div class="ttdeci">std::shared_ptr&lt; Node &gt; parent</div><div class="ttdef"><b>定义</b> <a href="#l00011">treeHeap.hpp:11</a></div></div>
<div class="ttc" id="astruct_tree_heap_1_1_node_html_a75f14b93093a2eaf649fe97f7173cefe"><div class="ttname"><a href="../../d2/d7b/struct_tree_heap_1_1_node.html#a75f14b93093a2eaf649fe97f7173cefe">TreeHeap::Node::right</a></div><div class="ttdeci">std::shared_ptr&lt; Node &gt; right</div><div class="ttdef"><b>定义</b> <a href="#l00010">treeHeap.hpp:10</a></div></div>
<div class="ttc" id="astruct_tree_heap_1_1_node_html_abeb17dd9d45f77ef6d19229e4b59c7e7"><div class="ttname"><a href="../../d2/d7b/struct_tree_heap_1_1_node.html#abeb17dd9d45f77ef6d19229e4b59c7e7">TreeHeap::Node::value</a></div><div class="ttdeci">T value</div><div class="ttdef"><b>定义</b> <a href="#l00008">treeHeap.hpp:8</a></div></div>
</div><!-- fragment --></div><!-- contents -->
<!-- start footer part -->
<hr class="footer"/><address class="footer"><small>
制作者&#160;<a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.11.0
</small></address>
</div><!-- doc-content -->
</body>
</html>
